Separating the Power of EREW and CREW PRAMs with Small Communication Width
نویسندگان
چکیده
We prove that evaluating a Boolean decision tree of height h requires ( h m+log h ) time on any EREW PRAM with communication width m and any number of processors. Since this function can be easily computed in time O( p h) on a CREW PRAM with communication width one using 2 O(h) processors, this gives a separation between the two models whenever the EREW PRAM has communication width m 2 o( p h). PROPOSED RUNNING HEAD: Separating EREW and CREW PRAMs
منابع مشابه
On Separating the Erew and Crew Pram Models
In [6], Snir proposed the Selection Problem (searching in a sorted table) to show that the CREW PRAM is strictly more powerful than the EREW PRAM. This problem defines a partial function, that is, one that is defined only on a restricted set of inputs. Recognizing whether an arbitrary input belongs to this restricted set is hard for both CREW and EREW PRAMs. The existence of a total function th...
متن کاملUniform Circuits and Exclusive Read Prams 3 (preliminary Version, January 1991)
CRCW-PRAMs can be characterized in terms of unbounded fan-in circuits. We introduce the notion of SELECT-gates. Combining this with the concept of an unambiguous circuit we are able to give a circuit equivalent of EREW-PRAMs, thus answering an open question of [SV84]. Moreover, circuits with SELECT-gates characterize CRCW-, CREW-, ERCW-, and EREW-PRAMs in a uniform manner.
متن کاملApproximate Compaction and Padded-Sorting on Exclusive Write PRAMs
Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, paddedsorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is considerably lower than time complexity of ...
متن کاملPercent Improvement for 3d Algorithms on 16k Processor Mp-1
We presented optimal direct warp algorithms for CREW and EREW PRAMs. 2D warping is important for image processing and graphics. 3D volume rotations are important for scientific visualization of voxel data. The EREW PRAM algorithm is restricted to nonscaling affine transforms, but is more efficient than the CREW algorithm in practice. The parallel run time complexity of both algorithms is using ...
متن کاملFeasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs
It was shown some years ago that the computation time for many important Boolean functions of n arguments on concurrent-read exclusive-write parallel random-access machines (CREW PRAMs) of unlimited size is at least '(n) 0:72 log2 n. On the other hand, it is known that every Boolean function of n arguments can be computed in '(n) + 1 steps on a CREW PRAM with n 2n 1 processors and memory cells....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993